Kona: A Multi-junction Detector Using Minimum Description Length Principle

نویسندگان

  • Laxmi Parida
  • Davi Geiger
  • Robert A. Hummel
چکیده

Corners, T-, Y-, X-junctions give vital depth cues which is a critical aspect of image \understanding": junctions form an important class of features invaluable in most vision systems. The three main issues in a junction (or any feature) detector are: scale, location, and, the junction (feature) parameters. The junction parameters are (1) the radius, or size, of the junction, (2) the kind of junction: lines, corners, 3-junctions such as T or Y, or, 4-junction such as X-junction, etcetra, (3) angles of the wedges, and, (4) intensity in each of the wedges. Our main contribution in this paper is a modeling of the junction (using the minimum description length principle), which is complex enough to handle all the three issues and simple enough to admit an eeective dynamic programming solution. Kona is an implementation of this model. Similar approach can be used to model other features like thick edges, blobs and end-points.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Junctions: Detection, Classiication and Reconstruction

Junctions are important features for image analysis and form a critical aspect of image understanding tasks such as object recognition. We present a uniied approach to detecting (location of the center of the junction), classifying (by the number of wedges { lines, corners, 3-junctions such as T or Y junctions, or 4-junctions such as X-junctions) and reconstructing junctions (in terms of radius...

متن کامل

Junctions: Detection, Classification, and Reconstruction

Junctions are important features for image analysis and form a critical aspect of image understanding tasks such as object recognition. We present a unified approach to detecting (location of the center of the junction), classifying (by the number of wedges—lines, corners, three-junctions such as T or Y junctions, or four-junctions such as X-junctions), and reconstructing junctions (in terms of...

متن کامل

Segmentation and Classiication of Edges Using Minimum Description Length Approximation and Complementary Junction Cues

This article presents a method for segmenting and classifying edges using minimum description length (MDL) approximation with automatically generated break points. A scheme is proposed where junction candidates are rst detected in a multi-scale pre-processing step, which generates junction candidates with associated regions of interest. These junction features are matched to edges based on spat...

متن کامل

Segmentation and Classi cation of Edges Using Minimum Description Length Approximation and Complementary Junction Cues

This article presents a method for segmenting and classifying edges using minimum description length (MDL) approximation with automatically generated break points. A scheme is proposed where junction candidates are rst detected in a multi-scale preprocessing step, which generates junction candidates with associated regions of interest. These junction features are matched to edges based on spati...

متن کامل

Segmentation and Classification of Edges Using Minimum Description Length Approximation and Complementary Junction Cues

This article presents a method for segmenting and classifying edges using minimum description length (MDL) approximation with automatically generated break points. A scheme is proposed where junction candidates are rst detected in a multi-scale pre-processing step, which generates junction candidates with associated regions of interest. These junction features are matched to edges based on spat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997